Belief Update in CLG Bayesian Networks With Lazy Propagation

نویسنده

  • Andres Madsen
چکیده

In recent years Bayesian networks (BNs) with a mixture of continuous and discrete variables have received an increasing level of attention. We present an architecture for exact belief update in Conditional Linear Gaussian BNs (CLG BNs). The architecture is an extension of lazy propagation using operations of Lauritzen & Jensen [6] and Cowell [2]. By decomposing clique and separator potentials into sets of factors, the proposed architecture takes advantage of independence and irrelevance properties induced by the structure of the graph and the evidence. The resulting benefits are illustrated by examples. Results of a preliminary empirical performance evaluation indicate a significant potential of the proposed architecture.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Methods for Marginalization in Lazy Propagation

Even though existing algorithms for belief update in Bayesian networks (BNs) have exponential time and space complexity, belief update in many real-world BNs is feasible. However, in some cases the efficiency of belief update may be insufficient. In such cases minor improvements in efficiency may be important or even necessary to make a task tractable. This paper introduces two improvements to ...

متن کامل

On the Importance of Elimination Heuristics in Lazy Propagation

Belief update in a Bayesian network using Lazy Propagation (LP) proceeds by message passing over a junction tree (JT). In the process of computing a message, a set of variables is eliminated. As the JT provides only a partial order on the elimination of variables, it is necessary to identify elimination orders on-line. This paper considers the importance of elimination heuristics in LP when usi...

متن کامل

Ordering arc-reversal operations when eliminating variables in lazy AR propagation

This paper considers the problem of ordering arc-reversal operations and breaking ties in cost measures when eliminating variables in Lazy AR Propagation (LPAR). In particular, the paper presents the BreakTies algorithm for breaking ties in cost measures when selecting the next arc to reverse in a variable elimination operation. BreakTies is based upon using a sequence of cost measures instead ...

متن کامل

Inference in Multiply Sectioned Bayesian

As Bayesian networks are applied to larger and more complex problem domains, search for exible modeling and more eecient inference methods is an ongoing eeort. Multiply sectioned Bayesian networks (MSBNs) extend the HUGIN inference for Bayesian networks into a coherent framework for exible modeling and distributed inference. Lazy propagation extends the Shafer-Shenoy and HUGIN inference methods...

متن کامل

Inference in Multiply Sectioned Bayesian Networks with Extended Shafer-Shenoy and Lazy Propagation

As Bayesian networks are applied to larger and more complex problem domains, search for flexible modeling and more efficient in­ ference methods is an ongoing effort. Mul­ tiply sectioned Bayesian networks (MSBNs) extend the HUGIN inference for Bayesian networks into a coherent framework for flexible modeling and distributed inference. Lazy propagation extends the Shafer-Shenoy and HUG IN infer...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Approx. Reasoning

دوره 49  شماره 

صفحات  -

تاریخ انتشار 2006